A new merit function and a descent method for semide nite complementarity problems

نویسندگان

  • Nobuo Yamashita
  • Masao Fukushima
چکیده

Recently, Tseng extended several merit functions for the nonlinear complementarity problem to the semide nite complementarity problem (SDCP) and investigated various properties of those functions. In this paper, we propose a new merit function for the SDCP based on the squared Fischer-Burmeister function and show that it has some favorable properties. Particularly, we give conditions under which the function provides a global error bound for the SDCP and conditions under which it has bounded level sets. We also present a derivative-free method for solving the SDCP and prove its global convergence under suitable assumptions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new merit function and a descent method for semide nite complementarity problems 1

Recently, Tseng extended several merit functions for the nonlinear complementarity problem to the semide nite complementarity problem (SDCP) and investigated various properties of those functions. In this paper, we propose a new merit function for the SDCP based on the squared Fischer-Burmeister function and show that it has some favorable properties. Particularly, we give conditions under whic...

متن کامل

The Extended Semide nite Linear Complementarity Problem: A Reformulation Approach

In this paper we consider the extended semide nite linear complementarity problem (XSDLCP). We propose merit functions that can constitute minimization problems equivalent to XSDLCP and show some properties of these functions. We also consider the semide nite nonlinear complementarity problem (SDNCP) and give new su cient conditions that guarantee the existence of a solution to SDNCP.

متن کامل

Symmetric primal dual path following algorithms for semide nite programming

We propose a framework for developing and analyzing primal dual interior point algorithms for semide nite programming This framework is an extension of the v space approach that was de veloped by Kojima et al for linear complementarity problems The extension to semide nite programming allows us to interpret Nesterov Todd type directions as Newton search direc tions Our approach does not involve...

متن کامل

Monotone Semide nite Complementarity Problems

In this paper, we study some basic properties of the monotone semide nite nonlinear complementarity problem (SDCP). We show that the trajectory continuously accumulates into the solution set of the SDCP passing through the set of the infeasible but positive de nite matrices under certain conditions. Especially, for the monotone semide nite linear complementarity problem, the trajectory converge...

متن کامل

Interior-Point Methods

The modern era of interior-point methods dates to 1984, when Karmarkar proposed his algorithm for linear programming. In the years since then, algorithms and software for linear programming have become quite sophisticated, while extensions to more general classes of problems, such as convex quadratic programming, semide nite programming, and nonconvex and nonlinear problems, have reached varyin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997